Papers with graph learning
Exploiting Node Content for Multiview Graph Convolutional Network and Adversarial Regularization (2020.coling-main)
Copied to clipboard
Qiuhao Lu, Nisansa de Silva, Dejing Dou, Thien Huu Nguyen, Prithviraj Sen, Berthold Reinwald, Yunyao Li
| Challenge: | Existing graph autoencoders and its variants have been used for node embedding . a new method is proposed to model consistency across different views of networks . |
| Approach: | They propose a network embedding method which enforces latent representations to be consistent across different views of networks by incorporating a multiview adversarial regularization module. |
| Outcome: | The proposed method compares favorably with the state-of-the-art methods on benchmark datasets and on a real-world application. |
LPNL: Scalable Link Prediction with Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing studies on graph learning with large language models have focused on the link prediction task on large graphs. |
| Approach: | They propose a framework for scalable link prediction on large-scale heterogeneous graphs based on large language models. |
| Outcome: | The proposed framework outperforms baselines in link prediction tasks on large graphs. |
Psycholinguistic Tripartite Graph Network for Personality Detection (2021.acl-long)
Copied to clipboard
| Challenge: | Existing work on personality detection from online posts adopts multifarious deep neural networks to represent the posts and builds predictive models in a data-driven manner without the exploitation of psycholinguistic knowledge. |
| Approach: | They propose a psycholinguistic knowledge-based tripartite graph network, TrigNet, which consists of a tripartitic graph network and a BERT-based graph initializer. |
| Outcome: | The proposed graph network outperforms the existing state-of-the-art model by 3.47 and 2.10 points in average F1 on two datasets. |
Predicting the Unpredictable: Uncertainty-Aware Reasoning over Temporal Knowledge Graphs via Diffusion Process (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for Temporal Knowledge Graph reasoning capture indeterminacy in future events, but they are limited in capturing it. |
| Approach: | They propose a Temporal Knowledge Graph reasoning process that denoises historical events and introduces Gaussian noise to corrupt target facts. |
| Outcome: | Empirical results show that DiffuTKG outperforms state-of-the-art methods on four real-world datasets. |
Exploring Graph Learning Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent studies focus on performance benchmarks without fully comparing LLMs to graph learning models. |
| Approach: | They evaluate off-the-shelf and instruction-tuned graph learning models across a variety of scenarios. |
| Outcome: | The proposed models outperform traditional graph learning models in few-shot settings, the authors show . their models out perform models with instruction tuning, and they show excellent generalization and robustness. |
Advancement in Graph Understanding: A Multimodal Benchmark and Fine-Tuning of Vision-Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Graph data organizes complex relationships and interactions between objects . Graph neural networks (GNNs) are becoming more popular in graph learning . |
| Approach: | They propose a new paradigm for interactive and instructional graph data understanding and reasoning . they first evaluate the capabilities of public VLMs in graph learning from multiple aspects . |
| Outcome: | The proposed model achieves an accuracy increase of 5%-15% compared to baseline models . the best-performing model achieve scores comparable to Gemini in GPT-asissted Evaluation . |
Text-Attributed Graph Learning with Coupled Augmentations (2025.coling-main)
Copied to clipboard
| Challenge: | Existing models focus on either the text attribute or the graph structure, neglecting the other aspect. |
| Approach: | They propose a model that combines the strengths of both text-learning and graph-learning models in parallel. |
| Outcome: | The proposed model outperforms existing models on diverse datasets. |
AgentGL: Towards Agentic Graph Learning with LLMs via Reinforcement Learning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing agentic frameworks treat external information as unstructured text and fail to leverage topological dependencies inherent in real-world data. |
| Approach: | They propose to reframe graph learning as an interleaved process of topology-aware navigation and LLM-based inference. |
| Outcome: | The proposed framework outperforms strong GraphLLMs and GraphRAG benchmarks in multiple LLM backbones. |
Graph-R1: Incentivizing the Zero-Shot Graph Learning Capability in LLMs via Explicit Reasoning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in Large Reasoning Models (LLMs) provide a zero-shot alternative via explicit, long chain-of-thought reasoning. |
| Approach: | They propose a GNN-free approach that reformulates graph tasks as textual reasoning problems solved by LRMs. |
| Outcome: | The proposed approach outperforms state-of-the-art baselines in zero-shot settings, producing interpretable and effective predictions. |
From Nodes to Narratives: Explaining Graph Neural Networks with LLMs and Graph Context (2026.acl-long)
Copied to clipboard
| Challenge: | Existing explanation methods for graph neural networks struggle to generate interpretable, fine-grained rationales. |
| Approach: | They propose a lightweight framework that uses large language models to generate interpretable explanations for GNNs. |
| Outcome: | The proposed framework generates interpretable explanations for GNN predictions using large language models. |